1
کامپیوتر و شبکه::
حلقهٔ وظیفه
Such path is called as a task loop, and there will be a delay block inserted into the task loop to avoid deadlock.
However, for acyclic graphs, communication pipeline can be used as much as possible, while for cyclic graphs, the usage of communi- cation pipeline is limited by the number of delayed iterations in the task loop to avoid deadlock [6].
Therefore, in a task loop with K delay iterations and M receiving blocks, we can preprocess part of the tasks before the iteration of the corresponding processor and apply communication pipeline to min(K 1, M ) receiving tasks.
As communication pipeline allocation requires the consideration of cyclic topologies, we first exploit Tarjan's algorithm [36] to find all task loops of the application graph, and then solve the ILP formulations.
• Communication pipeline quantity constraint (only for cyclic graphs): in each task loop, the maximum number of communication pipeline used should be 1 less than the number of delayed iterations in this loop.
واژگان شبکه مترجمین ایران